Large Cliques in a Power-Law Random Graph
نویسندگان
چکیده
منابع مشابه
Large Cliques in a Power-law Random Graph
We study the size of the largest clique ω(G(n, α)) in a random graphG(n, α) on n vertices which has power-law degree distribution with exponent α. We show that for ‘flat’ degree sequences with α > 2 whp the largest clique in G(n, α) is of a constant size, while for the heavy tail distribution, when 0 < α < 2, ω(G(n, α)) grows as a power of n. Moreover, we show that a natural simple algorithm wh...
متن کاملEstimation of Cliques in a Random Graph
This paper examines methods for predicting and estimating the number of maximal cliques in a random graph. A clique is a subgraph where each vertex is connected to every other vertex in the subgraph. A maximal clique is a clique which is not a proper subgraph of another clique. There are many algorithms that enumerate all maximal cliques in a graph, but since the task can take exponential time,...
متن کاملLoglog distances in a power law random intersection graph
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we construct OP (log log n) upper bound for the length of the shortest path connecting them. key words: intersection graph, random graph, power law, giant compon...
متن کاملA Random Graph Model for Power Law Graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences which satisfy a power law. This model involves only a small number of parameters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs. Furthermore, from these parameters, various properties of the graph can be derived. For exam...
متن کاملLarge Cliques in Sparse Random Intersection Graphs
Given positive integers n and m, and a probability measure P on {0, 1, . . . ,m}, the random intersection graph G(n,m,P ) on vertex set V = {1, 2, . . . , n} and with attribute set W = {w1, w2, . . . , wm} is defined as follows. Let S1, S2, . . . , Sn be independent random subsets of W such that for any v ∈ V and any S ⊆ W we have P(Sv = S) = P (|S|)/ ( m |S| ) . The edge set of G(n,m,P ) consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2010
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200007415